package com.awei.study.dataStructure.queue.abs;

/**
 * @Author liweilong
 * @Date 2023/5/24 11:29
 */
public interface DoubleEndQueue<E> {

//    class Node<E> {
//        Node<E> prev;
//        E value;
//        Node<E> next;
//
//        public Node(Node<E> prev, E value, Node<E> next) {
//            this.prev = prev;
//            this.value = value;
//            this.next = next;
//        }
//    }

    public boolean offerHead(E value);

    public boolean offerTail(E value);

    public E pollHead();

    public E pollTail();

    public E peekHead();

    public E peekTail();

    public boolean isEmpty();

    public boolean isFull();
}
